Generic Process Algebra: A Programming Challenge

نویسندگان

  • Paula R. Ribeiro
  • Marco Antonio Barbosa
  • Luís Soares Barbosa
چکیده

Emerging interaction paradigms, such as service-oriented computing, and new technological challenges, such as exogenous component coordination, suggest new roles and application areas for process algebras. This, however, entails the need for more generic and adaptable approaches to their design. For example, some applications may require similar programming constructs coexisting with different interaction disciplines. In such a context, this paper pursues a research programme on a coinductive rephrasal of classic process algebra, proposing a clear separation between structural aspects and interaction disciplines. A particular emphasis is put on the study of interruption combinators defined by natural co-recursion. The paper also illustrates the verification of their properties in an equational and pointfree reasoning style as well as their direct encoding in Haskell.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method

 This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...

متن کامل

Generic Programming for High Performance Numerical Linear Algebra

We present a generic programming methodology for expressing data structures and algorithms for high-performance numerical linear algebra. As with the Standard Template Library [14], our approach explicitly separates algorithms from data structures, allowing a single set of numerical routines to operate with a wide variety of matrix types, including sparse, dense, and banded. Through the use of ...

متن کامل

Fuzzy Real-Time Optimization of the Tennessee Eastman Challenge Process

A Real-Time Optimization (RTO) strategy incorporating the fuzzy sets theory is developed, where the problem constraints obtained from process considerations are treated in fuzzy environment. Furthermore, the objective function is penalized by a fuzzified form of the key process constraints. To enable using conventional optimization techniques, the resulting fuzzy optimization problem is the...

متن کامل

How To Lift a Library

Generic algebraic libraries run the risk of losing eeciency compared to non-generic libraries. To solve the seeming antagonism between genericity and eeciency, we propose a technique which we call lifting. The lifting process is an abstraction process which starts with a well-known eecient algorithm and abstracts carefully from it. As lifting guarantees that fast non-generic algorithms instanti...

متن کامل

The Matrix Template Library: generic components for high-performance scientific computing

COMPUTING IN SCIENCE & ENGINEERING tal paradigm underlying the STL, was an important and powerful new software development methodology—and this has been borne out by the tremendous success of the STL for generalpurpose programming. Not so obvious then, however, was how (or even if) generic programming could apply to other problem domains. To investigate the merit of this approach for scientific...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. UCS

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2006